The Euclidean Traveling Salesman Problem and a Space-filling Curve
نویسنده
چکیده
We elucidate the relationship between space-llling curves and the Euclidean Traveling 2 Salesman Problem (TSP) by reference to a particular space-lling curve whose scaling behaviour is strongly related to the conjectured scaling behaviour of the optimal TSP tour. We suggest that space-lling curves can be used to generate testbed TSPs: sets of points which in the limit cover a planar surface and for which tours of minimum length are known.
منابع مشابه
Genetically Improved Presequences for Euclidean Traveling Salesman Problems
The spscefilling curve (SFC) method of Bartholdy and Platzman is an extremely fast heuristic for the Euclidean Traveling Salesman Problem. The authors show how genetic search over a parametrized family of spacefilling curves can be used to improve the quality of the the tours generated by SFC. The computational effort required grows slowly as a function of problem size, and the tours obtained d...
متن کاملOn the Space lling Curve Heuristic for the Euclidean Traveling Salesman Problem
Bartholdi and Platzman proposed the space lling curve heuristic for the Euclidean Traveling Salesman Problem and proved that their heuristic returns a tour within an O lg n factor of optimal length They conjectured that the worst case ratio is in fact O In this note we exhibit a counterexample showing the O lg n upper bound is tight This research is partially supported by the National Science F...
متن کاملAN EFFICIENT CROSSOVER OPERATOR FOR TRAVELING SALESMAN PROBLEM
Crossover operator plays a crucial role in the efficiency of genetic algorithm (GA). Several crossover operators have been proposed for solving the travelling salesman problem (TSP) in the literature. These operators have paid less attention to the characteristics of the traveling salesman problem, and majority of these operators can only generate feasible solutions. In this paper, a crossover ...
متن کاملNew Heuristic Algorithms for Solving Single-Vehicle and Multi-Vehicle Generalized Traveling Salesman Problems (GTSP)
Among numerous NP-hard problems, the Traveling Salesman Problem (TSP) has been one of the most explored, yet unknown one. Even a minor modification changes the problem’s status, calling for a different solution. The Generalized Traveling Salesman Problem (GTSP)expands the TSP to a much more complicated form, replacing single nodes with a group or cluster of nodes, where the objective is to fi...
متن کاملSolving the Multiple Traveling Salesman Problem by a Novel Meta-heuristic Algorithm
The multiple traveling salesman problem (MTSP) is a generalization of the famous traveling salesman problem (TSP), where more than one salesman is used in the solution. Although the MTSP is a typical kind of computationally complex combinatorial optimization problem, it can be extended to a wide variety of routing problems. This paper presents an efficient and evolutionary optimization algorith...
متن کامل